TSTP Solution File: SEV161^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV161^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:34 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 14 ( 7 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 53 ( 9 ~; 0 |; 0 &; 40 @)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 ^ 12 !; 9 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a ).
thf(func_def_5,type,
sK1: a > a > $o ).
thf(func_def_6,type,
sK2: a ).
thf(f11,plain,
$false,
inference(trivial_inequality_removal,[],[f10]) ).
thf(f10,plain,
( ( sK1 @ sK2 @ sK0 )
!= ( sK1 @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( sK1 @ sK2 @ sK0 )
!= ( sK1 @ sK2 @ sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: a,X1: a > a > $o,X2: a] :
( ( X1 @ X2 @ X0 )
!= ( X1 @ X2 @ X0 ) )
=> ( ( sK1 @ sK2 @ sK0 )
!= ( sK1 @ sK2 @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a,X1: a > a > $o,X2: a] :
( ( X1 @ X2 @ X0 )
!= ( X1 @ X2 @ X0 ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X1: a,X0: a > a > $o,X2: a] :
( ( X0 @ X2 @ X1 )
!= ( X0 @ X2 @ X1 ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > $o,X1: a,X2: a] :
( ( X0 @ X2 @ X1 )
= ( X0 @ X2 @ X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > $o,X1: a,X2: a] :
( ( X0 @ X2 @ X1 )
<=> ( X0 @ X2 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o,X2: a,X1: a] :
( ( X0 @ X1 @ X2 )
<=> ( X0 @ X1 @ X2 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > $o,X2: a,X1: a] :
( ( X0 @ X1 @ X2 )
<=> ( X0 @ X1 @ X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.0BJV0KwnHC/Vampire---4.8_12406',cTHM183_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SEV161^5 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 12:17:21 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.0BJV0KwnHC/Vampire---4.8_12406
% 0.15/0.38 % (12684)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.38 % (12681)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.38 % (12682)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.38 % (12686)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.38 % (12685)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.38 % (12687)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.38 % (12688)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.15/0.38 % (12681)First to succeed.
% 0.15/0.38 % (12689)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.38 % (12685)Also succeeded, but the first one will report.
% 0.15/0.38 % (12686)Also succeeded, but the first one will report.
% 0.15/0.38 % (12681)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for Vampire---4
% 0.15/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.38 % (12681)------------------------------
% 0.15/0.38 % (12681)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (12681)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (12681)Memory used [KB]: 5373
% 0.15/0.38 % (12681)Time elapsed: 0.004 s
% 0.15/0.38 % (12681)Instructions burned: 1 (million)
% 0.15/0.38 % (12681)------------------------------
% 0.15/0.38 % (12681)------------------------------
% 0.15/0.38 % (12678)Success in time 0.011 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------